On Compress-Forward without Wyner-Ziv Binning for Relay Networks
نویسندگان
چکیده
Noisy network coding is recently proposed for the general multi-source network by Lim, Kim, El Gamal and Chung. This scheme builds on compress-forward (CF) relaying but involves three new ideas, namely no Wyner-Ziv binning, relaxed simultaneous decoding and message repetition. In this paper, using the two-way relay channel as the underlining example, we analyze the impact of each of these ideas on the achievable rate region of relay networks. First, CF without binning but with joint decoding of both the message and compression index can achieve a larger rate region than the original CF scheme for multi-destination relay networks. With binning and successive decoding, the compression rate at each relay is constrained by the weakest link from the relay to a destination; but without binning, this constraint is relaxed. Second, simultaneous decoding of all messages over all blocks without uniquely decoding the compression indices can remove the constraints on compression rate completely, but is still subject to the message block boundary effect. This boundary effect is caused by the decoding of signal received in the last block, in which not all inputs and outputs may be regularly involved. Third, message repetition is necessary to overcome this boundary effect and achieve the noisy network coding region for multi-source networks. The rate region is enlarged with increasing repetition times. We also apply CF without binning specifically to the one-way and two-way relay channels and analyze the rate regions in detail. For the one-way relay channel, it achieves the same rate as the original CF and noisy network coding but has only 1 block decoding delay. For the two-way relay channel, we derive the explicit channel conditions in the Gaussian and fading cases for CF without binning to achieve the same rate region or sum rate as noisy network coding. These analyses may be appealing to practical implementation because of the shorter encoding and decoding delay in CF without binning.
منابع مشابه
Coding Schemes for the Two-Way Relay Channels
In modern transmission networks, relay plays an important role for cooperative strategies. Several relaying strategies, such as decode-forward, compress-forward and amplify-forward, have been proposed for relay channels and networks. However, the capacity for the general relay channel and network is still unknown. In this thesis, we propose several relay schemes for different relay models. In t...
متن کاملQuantifying the Loss of Compress-Forward Relaying Without Wyner-Ziv Coding
The compress and forward strategy achieves the optimal diversity-multiplexing tradeoff (DMT) of a three-node half-duplex relay network in slow fading, under the assumption that the relay has perfect knowledge of all three channel coefficients and that the relay makes use of Wyner-Ziv (WZ) source coding with side information. This paper studies the achievable DMT of the same network when the rel...
متن کاملAchievable rates for relay networks using superposition coding
We investigate the superposition strategy and its usefulness in terms of achievable information theoretic rates. The achievable rate of the superposition of block Markov encoding (decode-forward) and side information encoding (compress-forward) for the three-node Gaussian relay channel is analyzed. It is generally believed that the superposition can out perform decode-forward or compress-forwar...
متن کاملWyner-Ziv Coding in the Real Field Based on BCH-DFT Codes
We show how real-number codes can be used to compress correlated sources and establish a new framework for distributed lossy source coding, in which we quantize compressed sources instead of compressing quantized sources. This change in the order of binning and quantization blocks makes it possible to model correlation between continuous-valued sources more realistically and compensate for the ...
متن کاملA New Coding Paradigm for the Primitive Relay Channel
We present a coding paradigm that provides a new achievable rate for the primitive relay channel by combining compress-and-forward and decode-and-forward with a chaining construction. In the primitive relay channel model, the source broadcasts a message to the relay and to the destination; and the relay facilitates this communication by sending an additional message to the destination through a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1111.2837 شماره
صفحات -
تاریخ انتشار 2011